منابع مشابه
Automated Proofs of Time Lower Bounds
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, MOD6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. These lower bound proofs all follow a certain diagonalization-based proof-by-contradiction strategy....
متن کاملLower bounds on Nullstellensatz proofs via designs
The Nullstellensatz proof system is a proof system for propositional logic based on algebraic identities in fields. Prior work has proved lower bounds of the degree Nullstellensatz refutations using combinatorial constructions called designs. This paper surveys the use of designs for Nullstellensatz lower bounds. We give a new, more general definition of designs. We present an explicit construc...
متن کاملLower Bounds to the Size of Constant-Depth Propositional Proofs
1 LK is a natural modiication of Gentzen sequent calculus for pro-positional logic with connectives : and V ; W (both of unbounded arity). Then for every d 0 and n 2, there is a set T d n of depth d sequents of total size O(n 3+d) which are refutable in LK by depth d + 1 proof of size exp(O(log 2 n)) but such that every depth d refutation must have the size at least exp(n (1)). The sets T d n e...
متن کاملAlgorithmic Lower Bounds : Fun With Hardness Proofs Fall 2014
We have seen many decision problems when we are concerned whether a solution exists. In ap proximation problems we had to define a stronger version of NP-style problems which are the optimization problem (NPO) when we want to find the best solution (that maximizes or minimizes some parameter). This class will cover counting problems and, as we did in the past, we will define another version of...
متن کاملA Alternation-Trading Proofs, Linear Programming, and Lower Bounds
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, MOD6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs of these lower bounds follow a proof-by-contradiction strategy that we call resource-trading or a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90110-1